TSTP Solution File: NUM638^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM638^4 : TPTP v8.1.2. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:55:52 EDT 2024
% Result : Theorem 0.56s 0.55s
% Output : CNFRefutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 41
% Syntax : Number of formulae : 91 ( 47 unt; 23 typ; 0 def)
% Number of atoms : 323 ( 107 equ; 0 cnn)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 576 ( 120 ~; 81 |; 17 &; 253 @)
% ( 0 <=>; 105 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 66 ( 66 >; 0 *; 0 +; 0 <<)
% Number of symbols : 26 ( 23 usr; 7 con; 0-3 aty)
% Number of variables : 135 ( 87 ^ 48 !; 0 ?; 135 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_23,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_25,type,
in: $i > $i > $o ).
thf(decl_47,type,
ordsucc: $i > $i ).
thf(decl_61,type,
imp: $o > $o > $o ).
thf(decl_62,type,
d_not: $o > $o ).
thf(decl_65,type,
l_ec: $o > $o > $o ).
thf(decl_66,type,
d_and: $o > $o > $o ).
thf(decl_71,type,
non: $i > ( $i > $o ) > $i > $o ).
thf(decl_72,type,
l_some: $i > ( $i > $o ) > $o ).
thf(decl_77,type,
e_is: $i > $i > $i > $o ).
thf(decl_78,type,
amone: $i > ( $i > $o ) > $o ).
thf(decl_79,type,
one: $i > ( $i > $o ) > $o ).
thf(decl_123,type,
nat: $i ).
thf(decl_124,type,
n_is: $i > $i > $o ).
thf(decl_125,type,
nis: $i > $i > $o ).
thf(decl_127,type,
n_some: ( $i > $o ) > $o ).
thf(decl_129,type,
n_one: ( $i > $o ) > $o ).
thf(decl_130,type,
n_1: $i ).
thf(decl_168,type,
esk29_1: $i > $i ).
thf(decl_169,type,
esk30_0: $i ).
thf(decl_170,type,
esk31_0: $i ).
thf(decl_171,type,
esk32_0: $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_imp) ).
thf(def_l_ec,axiom,
( l_ec
= ( ^ [X79: $o,X80: $o] : ( imp @ X79 @ ( d_not @ X80 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_l_ec) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_is_of) ).
thf(def_non,axiom,
( non
= ( ^ [X1: $i,X2: $i > $o,X4: $i] : ( d_not @ ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_non) ).
thf(def_d_and,axiom,
( d_and
= ( ^ [X81: $o,X82: $o] : ( d_not @ ( l_ec @ X81 @ X82 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_d_and) ).
thf(def_l_some,axiom,
( l_some
= ( ^ [X1: $i,X2: $i > $o] :
( d_not
@ ( all_of
@ ^ [X4: $i] : ( in @ X4 @ X1 )
@ ( non @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_l_some) ).
thf(def_amone,axiom,
( amone
= ( ^ [X1: $i,X2: $i > $o] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ X1 )
@ ^ [X4: $i] :
( all_of
@ ^ [X13: $i] : ( in @ X13 @ X1 )
@ ^ [X13: $i] :
( ( X2 @ X4 )
=> ( ( X2 @ X13 )
=> ( e_is @ X1 @ X4 @ X13 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_amone) ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_e_is) ).
thf(def_one,axiom,
( one
= ( ^ [X1: $i,X2: $i > $o] : ( d_and @ ( amone @ X1 @ X2 ) @ ( l_some @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_one) ).
thf(def_nis,axiom,
( nis
= ( ^ [X1: $i,X165: $i] : ( d_not @ ( n_is @ X1 @ X165 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_nis) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_n_is) ).
thf(def_n_some,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X349: $i] :
( ( in @ X349 @ nat )
=> ( ( Z0 @ X349 )
=> ~ $true ) )
=> ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_n_some) ).
thf(def_n_one,axiom,
( n_one
= ( ^ [Z0: $i > $o] :
( ( ! [X351: $i] :
( ( in @ X351 @ nat )
=> ! [X352: $i] :
( ( in @ X352 @ nat )
=> ( ( Z0 @ X351 )
=> ( ( Z0 @ X352 )
=> ( X351 = X352 ) ) ) ) )
=> ( ( ! [X353: $i] :
( ( in @ X353 @ nat )
=> ( ( Z0 @ X353 )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',def_n_one) ).
thf(satz3,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( ( nis @ X1 @ n_1 )
=> ( n_some
@ ^ [X175: $i] : ( n_is @ X1 @ ( ordsucc @ X175 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',satz3) ).
thf(satz3a,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( ( nis @ X1 @ n_1 )
=> ( n_one
@ ^ [X176: $i] : ( n_is @ X1 @ ( ordsucc @ X176 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',satz3a) ).
thf(ordsucc_inj,axiom,
! [X1: $i,X43: $i] :
( ( ( ordsucc @ X1 )
= ( ordsucc @ X43 ) )
=> ( X1 = X43 ) ),
file('/export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p',ordsucc_inj) ).
thf(c_0_18,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_19,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_20,plain,
( l_ec
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> ( Z1
=> ~ $true ) ) ) ),
inference(fof_simplification,[status(thm)],[def_l_ec]) ).
thf(c_0_21,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_all_of]) ).
thf(c_0_23,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_24,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_non]) ).
thf(c_0_25,plain,
( d_and
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ( Z1
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_and]) ).
thf(c_0_26,plain,
( l_ec
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> ( Z1
=> ~ $true ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20,c_0_19]),c_0_21]) ).
thf(c_0_27,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X322: $i] :
( ( in @ X322 @ Z0 )
=> ( ( Z1 @ X322 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_l_some]) ).
thf(c_0_28,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_29,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_24,c_0_21]) ).
thf(c_0_30,plain,
( amone
= ( ^ [Z0: $i,Z1: $i > $o] :
! [X324: $i] :
( ( in @ X324 @ Z0 )
=> ! [X323: $i] :
( ( in @ X323 @ Z0 )
=> ( ( Z1 @ X324 )
=> ( ( Z1 @ X323 )
=> ( X324 = X323 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_amone]) ).
thf(c_0_31,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_32,plain,
( one
= ( ^ [Z0: $i,Z1: $i > $o] :
( ( ! [X325: $i] :
( ( in @ X325 @ Z0 )
=> ! [X326: $i] :
( ( in @ X326 @ Z0 )
=> ( ( Z1 @ X325 )
=> ( ( Z1 @ X326 )
=> ( X325 = X326 ) ) ) ) )
=> ( ( ! [X327: $i] :
( ( in @ X327 @ Z0 )
=> ( ( Z1 @ X327 )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_one]) ).
thf(c_0_33,plain,
( d_and
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ( Z1
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_25,c_0_21]),c_0_26]) ).
thf(c_0_34,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X322: $i] :
( ( in @ X322 @ Z0 )
=> ( ( Z1 @ X322 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_27,c_0_28]),c_0_21]),c_0_29]) ).
thf(c_0_35,plain,
( amone
= ( ^ [Z0: $i,Z1: $i > $o] :
! [X324: $i] :
( ( in @ X324 @ Z0 )
=> ! [X323: $i] :
( ( in @ X323 @ Z0 )
=> ( ( Z1 @ X324 )
=> ( ( Z1 @ X323 )
=> ( X324 = X323 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_30,c_0_28]),c_0_31]) ).
thf(c_0_36,plain,
( nis
= ( ^ [Z0: $i,Z1: $i] :
( ( Z0 = Z1 )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_nis]) ).
thf(c_0_37,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_31]) ).
thf(c_0_38,plain,
( one
= ( ^ [Z0: $i,Z1: $i > $o] :
( ( ! [X325: $i] :
( ( in @ X325 @ Z0 )
=> ! [X326: $i] :
( ( in @ X326 @ Z0 )
=> ( ( Z1 @ X325 )
=> ( ( Z1 @ X326 )
=> ( X325 = X326 ) ) ) ) )
=> ( ( ! [X327: $i] :
( ( in @ X327 @ Z0 )
=> ( ( Z1 @ X327 )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]) ).
thf(c_0_39,plain,
( nis
= ( ^ [Z0: $i,Z1: $i] :
( ( Z0 = Z1 )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_36,c_0_21]),c_0_37]) ).
thf(c_0_40,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X349: $i] :
( ( in @ X349 @ nat )
=> ( ( Z0 @ X349 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[def_n_some,c_0_34]) ).
thf(c_0_41,axiom,
( n_one
= ( ^ [Z0: $i > $o] :
( ( ! [X351: $i] :
( ( in @ X351 @ nat )
=> ! [X352: $i] :
( ( in @ X352 @ nat )
=> ( ( Z0 @ X351 )
=> ( ( Z0 @ X352 )
=> ( X351 = X352 ) ) ) ) )
=> ( ( ! [X353: $i] :
( ( in @ X353 @ nat )
=> ( ( Z0 @ X353 )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[def_n_one,c_0_38]) ).
thf(c_0_42,plain,
! [X440: $i] :
( ( in @ X440 @ nat )
=> ( ( ( X440 = n_1 )
=> ~ $true )
=> ( ! [X439: $i] :
( ( in @ X439 @ nat )
=> ( ( X440
= ( ordsucc @ X439 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz3]),c_0_28]),c_0_37]),c_0_39]),c_0_40]) ).
thf(c_0_43,negated_conjecture,
~ ! [X444: $i] :
( ( in @ X444 @ nat )
=> ( ( ( X444 = n_1 )
=> ~ $true )
=> ( ( ! [X441: $i] :
( ( in @ X441 @ nat )
=> ! [X442: $i] :
( ( in @ X442 @ nat )
=> ( ( X444
= ( ordsucc @ X441 ) )
=> ( ( X444
= ( ordsucc @ X442 ) )
=> ( X441 = X442 ) ) ) ) )
=> ( ( ! [X443: $i] :
( ( in @ X443 @ nat )
=> ( ( X444
= ( ordsucc @ X443 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz3a])]),c_0_28]),c_0_37]),c_0_39]),c_0_41]) ).
thf(c_0_44,plain,
! [X891: $i] :
( ( ( in @ ( esk29_1 @ X891 ) @ nat )
| ~ $true
| ( X891 = n_1 )
| ~ ( in @ X891 @ nat ) )
& ( ( X891
= ( ordsucc @ ( esk29_1 @ X891 ) ) )
| ~ $true
| ( X891 = n_1 )
| ~ ( in @ X891 @ nat ) )
& ( $true
| ~ $true
| ( X891 = n_1 )
| ~ ( in @ X891 @ nat ) )
& ( ( in @ ( esk29_1 @ X891 ) @ nat )
| ~ $true
| $true
| ~ ( in @ X891 @ nat ) )
& ( ( X891
= ( ordsucc @ ( esk29_1 @ X891 ) ) )
| ~ $true
| $true
| ~ ( in @ X891 @ nat ) )
& ( $true
| ~ $true
| $true
| ~ ( in @ X891 @ nat ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])])])]) ).
thf(c_0_45,negated_conjecture,
! [X896: $i] :
( ( in @ esk30_0 @ nat )
& ( ( esk30_0 != n_1 )
| ~ $true )
& ( ~ ( in @ X896 @ nat )
| ( esk30_0
!= ( ordsucc @ X896 ) )
| ~ $true
| ~ $true
| ( in @ esk31_0 @ nat ) )
& ( $true
| ~ $true
| ( in @ esk31_0 @ nat ) )
& ( ~ ( in @ X896 @ nat )
| ( esk30_0
!= ( ordsucc @ X896 ) )
| ~ $true
| ~ $true
| ( in @ esk32_0 @ nat ) )
& ( $true
| ~ $true
| ( in @ esk32_0 @ nat ) )
& ( ~ ( in @ X896 @ nat )
| ( esk30_0
!= ( ordsucc @ X896 ) )
| ~ $true
| ~ $true
| ( esk30_0
= ( ordsucc @ esk31_0 ) ) )
& ( $true
| ~ $true
| ( esk30_0
= ( ordsucc @ esk31_0 ) ) )
& ( ~ ( in @ X896 @ nat )
| ( esk30_0
!= ( ordsucc @ X896 ) )
| ~ $true
| ~ $true
| ( esk30_0
= ( ordsucc @ esk32_0 ) ) )
& ( $true
| ~ $true
| ( esk30_0
= ( ordsucc @ esk32_0 ) ) )
& ( ~ ( in @ X896 @ nat )
| ( esk30_0
!= ( ordsucc @ X896 ) )
| ~ $true
| ~ $true
| ( esk31_0 != esk32_0 ) )
& ( $true
| ~ $true
| ( esk31_0 != esk32_0 ) )
& $true ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])])])])]) ).
thf(c_0_46,plain,
! [X1: $i] :
( ( in @ ( esk29_1 @ X1 ) @ nat )
| ( X1 = n_1 )
| ~ $true
| ~ ( in @ X1 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
thf(c_0_47,negated_conjecture,
( ( esk30_0 != n_1 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
thf(c_0_48,plain,
! [X1: $i] :
( ( X1
= ( ordsucc @ ( esk29_1 @ X1 ) ) )
| ( X1 = n_1 )
| ~ $true
| ~ ( in @ X1 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
thf(c_0_49,negated_conjecture,
! [X1: $i] :
( ( esk30_0
= ( ordsucc @ esk32_0 ) )
| ~ ( in @ X1 @ nat )
| ( esk30_0
!= ( ordsucc @ X1 ) )
| ~ $true
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
thf(c_0_50,plain,
! [X1: $i] :
( ( X1 = n_1 )
| ( in @ ( esk29_1 @ X1 ) @ nat )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_46]) ).
thf(c_0_51,negated_conjecture,
in @ esk30_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_45]) ).
thf(c_0_52,negated_conjecture,
esk30_0 != n_1,
inference(cn,[status(thm)],[c_0_47]) ).
thf(c_0_53,plain,
! [X1: $i] :
( ( X1 = n_1 )
| ( X1
= ( ordsucc @ ( esk29_1 @ X1 ) ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_48]) ).
thf(c_0_54,plain,
! [X645: $i,X646: $i] :
( ( ( ordsucc @ X645 )
!= ( ordsucc @ X646 ) )
| ( X645 = X646 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ordsucc_inj])])]) ).
thf(c_0_55,negated_conjecture,
! [X1: $i] :
( ( esk30_0
= ( ordsucc @ esk32_0 ) )
| ( esk30_0
!= ( ordsucc @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_49]) ).
thf(c_0_56,negated_conjecture,
in @ ( esk29_1 @ esk30_0 ) @ nat,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
thf(c_0_57,negated_conjecture,
( ( ordsucc @ ( esk29_1 @ esk30_0 ) )
= esk30_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_52]) ).
thf(c_0_58,negated_conjecture,
! [X1: $i] :
( ( esk30_0
= ( ordsucc @ esk31_0 ) )
| ~ ( in @ X1 @ nat )
| ( esk30_0
!= ( ordsucc @ X1 ) )
| ~ $true
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
thf(c_0_59,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1 @ nat )
| ( esk30_0
!= ( ordsucc @ X1 ) )
| ~ $true
| ~ $true
| ( esk31_0 != esk32_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
thf(c_0_60,plain,
! [X1: $i,X4: $i] :
( ( X1 = X4 )
| ( ( ordsucc @ X1 )
!= ( ordsucc @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
thf(c_0_61,negated_conjecture,
( ( ordsucc @ esk32_0 )
= esk30_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).
thf(c_0_62,negated_conjecture,
! [X1: $i] :
( ( esk30_0
= ( ordsucc @ esk31_0 ) )
| ( esk30_0
!= ( ordsucc @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_58]) ).
thf(c_0_63,negated_conjecture,
! [X1: $i] :
( ( esk32_0 != esk31_0 )
| ( esk30_0
!= ( ordsucc @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_59]) ).
thf(c_0_64,negated_conjecture,
! [X1: $i] :
( ( esk32_0 = X1 )
| ( ( ordsucc @ X1 )
!= esk30_0 ) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
thf(c_0_65,negated_conjecture,
( ( ordsucc @ esk31_0 )
= esk30_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_56]),c_0_57])]) ).
thf(c_0_66,negated_conjecture,
esk32_0 != esk31_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_56]),c_0_57])]) ).
thf(c_0_67,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : NUM638^4 : TPTP v8.1.2. Released v7.1.0.
% 0.05/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n031.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 10:07:46 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.46 Running higher-order theorem proving
% 0.17/0.46 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.dulnZBczDm/E---3.1_15175.p
% 0.17/0.50 # Type mismatch in argument #1 of indeq @ ($not @ db(4)) @ ($db_lam @ db(0) @ ($db_lam @ db(0) @ ($@_var @ db(6) @ db(1) @ db(0)))) @ db(3) @ (d_11_i @ ($not @ db(4)) @ ($db_lam @ db(0) @ ($db_lam @ db(0) @ ($@_var @ db(6) @ db(1) @ db(0)))) @ db(3) @ db(2) @ db(1)) @ db(0): expected $i but got $o
% 0.17/0.50 eprover: Type error
% 0.56/0.55 # Version: 3.1.0-ho
% 0.56/0.55 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.56/0.55 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.55 # Starting lpo1_fix with 900s (3) cores
% 0.56/0.55 # Starting full_lambda_9 with 300s (1) cores
% 0.56/0.55 # Starting almost_fo_4 with 300s (1) cores
% 0.56/0.55 # Starting new_ho_9 with 300s (1) cores
% 0.56/0.55 # Starting pre_casc_4 with 300s (1) cores
% 0.56/0.55 # Starting ho_unfolding_6 with 300s (1) cores
% 0.56/0.55 # lpo1_fix with pid 15253 completed with status 0
% 0.56/0.55 # Result found by lpo1_fix
% 0.56/0.55 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.56/0.55 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.55 # Starting lpo1_fix with 900s (3) cores
% 0.56/0.55 # No SInE strategy applied
% 0.56/0.55 # Search class: HGHSM-FSLM32-MHSMMSBN
% 0.56/0.55 # Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 0.56/0.55 # Starting full_lambda_5 with 82s (1) cores
% 0.56/0.55 # Starting new_ho_6 with 82s (1) cores
% 0.56/0.55 # Starting pre_casc_4 with 82s (1) cores
% 0.56/0.55 # pre_casc_4 with pid 15265 completed with status 0
% 0.56/0.55 # Result found by pre_casc_4
% 0.56/0.55 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.56/0.55 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.55 # Starting lpo1_fix with 900s (3) cores
% 0.56/0.55 # No SInE strategy applied
% 0.56/0.55 # Search class: HGHSM-FSLM32-MHSMMSBN
% 0.56/0.55 # Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 0.56/0.55 # Starting full_lambda_5 with 82s (1) cores
% 0.56/0.55 # Starting new_ho_6 with 82s (1) cores
% 0.56/0.55 # Starting pre_casc_4 with 82s (1) cores
% 0.56/0.55 # Preprocessing time : 0.005 s
% 0.56/0.55 # Presaturation interreduction done
% 0.56/0.55
% 0.56/0.55 # Proof found!
% 0.56/0.55 # SZS status Theorem
% 0.56/0.55 # SZS output start CNFRefutation
% See solution above
% 0.56/0.55 # Parsed axioms : 291
% 0.56/0.55 # Removed by relevancy pruning/SinE : 0
% 0.56/0.55 # Initial clauses : 416
% 0.56/0.55 # Removed in clause preprocessing : 158
% 0.56/0.55 # Initial clauses in saturation : 258
% 0.56/0.55 # Processed clauses : 502
% 0.56/0.55 # ...of these trivial : 4
% 0.56/0.55 # ...subsumed : 50
% 0.56/0.55 # ...remaining for further processing : 448
% 0.56/0.55 # Other redundant clauses eliminated : 28
% 0.56/0.55 # Clauses deleted for lack of memory : 0
% 0.56/0.55 # Backward-subsumed : 15
% 0.56/0.55 # Backward-rewritten : 10
% 0.56/0.55 # Generated clauses : 510
% 0.56/0.55 # ...of the previous two non-redundant : 481
% 0.56/0.55 # ...aggressively subsumed : 0
% 0.56/0.55 # Contextual simplify-reflections : 0
% 0.56/0.55 # Paramodulations : 450
% 0.56/0.55 # Factorizations : 0
% 0.56/0.55 # NegExts : 0
% 0.56/0.55 # Equation resolutions : 29
% 0.56/0.55 # Disequality decompositions : 0
% 0.56/0.55 # Total rewrite steps : 78
% 0.56/0.55 # ...of those cached : 44
% 0.56/0.55 # Propositional unsat checks : 0
% 0.56/0.55 # Propositional check models : 0
% 0.56/0.55 # Propositional check unsatisfiable : 0
% 0.56/0.55 # Propositional clauses : 0
% 0.56/0.55 # Propositional clauses after purity: 0
% 0.56/0.55 # Propositional unsat core size : 0
% 0.56/0.55 # Propositional preprocessing time : 0.000
% 0.56/0.55 # Propositional encoding time : 0.000
% 0.56/0.55 # Propositional solver time : 0.000
% 0.56/0.55 # Success case prop preproc time : 0.000
% 0.56/0.55 # Success case prop encoding time : 0.000
% 0.56/0.55 # Success case prop solver time : 0.000
% 0.56/0.55 # Current number of processed clauses : 164
% 0.56/0.55 # Positive orientable unit clauses : 65
% 0.56/0.55 # Positive unorientable unit clauses: 0
% 0.56/0.55 # Negative unit clauses : 19
% 0.56/0.55 # Non-unit-clauses : 80
% 0.56/0.55 # Current number of unprocessed clauses: 477
% 0.56/0.55 # ...number of literals in the above : 1202
% 0.56/0.55 # Current number of archived formulas : 0
% 0.56/0.55 # Current number of archived clauses : 268
% 0.56/0.55 # Clause-clause subsumption calls (NU) : 7999
% 0.56/0.55 # Rec. Clause-clause subsumption calls : 3728
% 0.56/0.55 # Non-unit clause-clause subsumptions : 22
% 0.56/0.55 # Unit Clause-clause subsumption calls : 821
% 0.56/0.55 # Rewrite failures with RHS unbound : 0
% 0.56/0.55 # BW rewrite match attempts : 28
% 0.56/0.55 # BW rewrite match successes : 4
% 0.56/0.55 # Condensation attempts : 0
% 0.56/0.55 # Condensation successes : 0
% 0.56/0.55 # Termbank termtop insertions : 41714
% 0.56/0.55 # Search garbage collected termcells : 10694
% 0.56/0.55
% 0.56/0.55 # -------------------------------------------------
% 0.56/0.55 # User time : 0.058 s
% 0.56/0.55 # System time : 0.011 s
% 0.56/0.55 # Total time : 0.069 s
% 0.56/0.55 # Maximum resident set size: 4648 pages
% 0.56/0.55
% 0.56/0.55 # -------------------------------------------------
% 0.56/0.55 # User time : 0.144 s
% 0.56/0.55 # System time : 0.021 s
% 0.56/0.55 # Total time : 0.165 s
% 0.56/0.55 # Maximum resident set size: 2100 pages
% 0.56/0.55 % E---3.1 exiting
% 0.56/0.55 % E exiting
%------------------------------------------------------------------------------